Relaxing Persistent Memory Constraints with Hardware-Driven Undo+Redo Logging

نویسندگان

  • Matheus A. Ogleari
  • Ethan L. Miller
  • Jishen Zhao
چکیده

Persistent memory is a new tier of memory that functions as a hybrid of traditional storage systems and main memory. It combines the benefits of both: the data persistence property of storage with the fast load/store interface of memory. Yet, efficiently supporting data persistence in memory requires non-trivial effort. In particular, logging is a widely used data persistence scheme due to its portability and flexibility benefits compared with logless mechanisms. However, traditional software logging mechanisms are expensive to adopt in persistent memory, due to their overhead on performance, energy, and implementation. Additionally, alternate proposed hardware-based logging schemes don’t fully address the issues with software. To address the challenges, we propose a hardware-driven undo+redo logging scheme, which maintains data persistence by leveraging the otherwise largely wasted hardware information available in the cache hierarchy. Our method allows persistent memory to exploit undo+redo logging to relax data persistence constraints on caching without nonvolatile on-chip buffering or caching components. Our evaluation across persistent memory microbenchmarks and real workloads demonstrates that our design leads to significant system throughput improvement and reduction in both dynamic energy and memory traffic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Persistent B+-Trees in Non-Volatile Main Memory

Computer systems in the near future are expected to have NonVolatile Main Memory (NVMM), enabled by a new generation of Non-Volatile Memory (NVM) technologies, such as Phase Change Memory (PCM), STT-MRAM, and Memristor. The non-volatility property has the promise to persist in-memory data structures for instantaneous failure recovery. However, realizing such promise requires a careful design to...

متن کامل

Persistent Memory Transactions

This paper presents a comprehensive analysis of performance trade offs between implementation choices for transaction runtime systems on persistent memory. We compare three implementations of transaction runtimes: undo logging, redo logging, and copy-on-write. We also present a memory allocator that plugs into these runtimes. Our microbenchmark based evaluation focuses on understanding the inte...

متن کامل

Fast Crash Recovery for a Distributed Column-Store Database Management System

A traditional database management system (DMBS) supports both atomic transactions and crash recovery by maintaining an undo/redo log. The standard write-ahead logging protocol, which requires a system to force the undo and redo log records describing a modified page to stable storage before writing the modified page to disk, ensures that sufficient information exists to perform recovery. After ...

متن کامل

Instant Recovery with Write-Ahead Logging: Page Repair, System Restart, and Media Restore

Traditional theory and practice of write-ahead logging and of database recovery techniques revolve around three failure classes: transaction failures resolved by rollback; system failures (typically software faults) resolved by restart with log analysis, “redo,” and “undo” phases; and media failures (typically hardware faults) resolved by restore operations that combine multiple types of backup...

متن کامل

Recovering from Main-Memory Lapses

Recovery activities like logging checkpointing and restart are used to restore a database to a consistent state after a system crash has occurred Recovery related overhead is likely to form a bottleneck in a main memory database since I O activities are performed for the sole purpose of ensuring data durability In this paper we present recovery algorithms which reduce recovery related overheads...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016